Conditioning Analysis of Incomplete Cholesky Factorizations with Orthogonal Dropping
نویسنده
چکیده
The analysis of preconditioners based on incomplete Cholesky factorization in which the neglected (dropped) components are orthogonal to the approximations being kept is presented. General estimate for the condition number of the preconditioned system is given which only depends on the accuracy of individual approximations. The estimate is further improved if, for instance, only the newly computed rows of the factor are modified during each approximation step. In this latter case it is further shown to be sharp. The analysis is illustrated with some existing factorizations in the context of discretized elliptic partial differential equations.
منابع مشابه
Direct and Incomplete Cholesky Factorizations with Static Supernodes
Introduction Incomplete factorizations of sparse symmetric positive definite (SSPD) matrices have been used to generate preconditioners for various iterative solvers. These solvers generally use preconditioners derived from the matrix system, , in order to reduce the total number of iterations until convergence. In this report, we investigate the findings of ref. [1] on their method for computi...
متن کاملNORGES TEKNISK-NATURVITENSKAPELIGE UNIVERSITET Specifying Gaussian Markov Random Fields with Incomplete Orthogonal Factorization using Givens Rotations
In this paper an approach for finding a sparse incomplete Cholesky factor through an incomplete orthogonal factorization with Givens rotations is discussed and applied to Gaussian Markov random fields (GMRFs). The incomplete Cholesky factor obtained from the incomplete orthogonal factorization is usually sparser than the commonly used Cholesky factor obtained through the standard Cholesky facto...
متن کاملCrout Versions of ILU for General Sparse Matrices
This paper presents an e cient implementation of incomplete LU (ILU) factorizations that are derived from the Crout version of Gaussian elimination (GE). At step k of the elimination, the k-th row of U and the k-th column of L are computed using previously computed rows of U and columns of L. The data structure and implementation borrow from already known techniques used in developing both spar...
متن کاملParallel Incomplete Cholesky Preconditioners Based on the Non-Overlapping Data Distribution
The paper analyses various parallel incomplete factorizations based on the non-overlapping domain decomposition. The general framework is applied to the investigation of the preconditioning step in cg-like methods. Under certain conditions imposed on the nite element mesh, all matrix and vector types given by the special data distribution can be used in the matrix-by-vector multiplications. Not...
متن کاملIncomplete Cholesky Factorizations with Limited Memory
We propose an incomplete Cholesky factorization for the solution of large-scale trust region subproblems and positive definite systems of linear equations. This factorization depends on a parameter p that specifies the amount of additional memory (in multiples of n, the dimension of the problem) that is available; there is no need to specify a drop tolerance. Our numerical results show that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 34 شماره
صفحات -
تاریخ انتشار 2013